Multi Depot Vehicle Routing Problem and Geographical Information System Integration: Retail Stores Case Study
نویسندگان
چکیده
The improper delivery route planning of multi depot and assignment model leads the logistic operation in high travel distance distribution cost. This paper aim to explain integration vehicle routing problem (MDVRP) Geographical Information System (GIS) obtain optimum with minimum by using multi-objective mixed integer programming approach visualize its open-source public GIS integration. In this research, coordinate location depots retail stores are obtained, process raw data through mathematical programming, then integrate plan for visualization. To validate proposed model, primary a chain was used evaluated sensitivity analysis, resulted value total daily operation.
منابع مشابه
capacitated multi-depot vehicle routing problem with inter-depot routes
in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...
متن کاملThe Multi-Depot Vehicle Routing Problem with Inter-Depot Routes
This article addresses an extension of the multi-depot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. It proposes a heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming. Tests are conducted on randomly generated instances.
متن کاملVehicle Routing Problem with Multi-depot and Multi-task
This paper presents a new mathematical model of the vehicle routing problem in the context of city distribution, which considers multi-depot, multi-model vehicles and multi-task. The objective function includes three parts: transport cost, deadheading cost and time cost. To solve this mathematical model, a self-adaptive and polymorphic ant colony algorithm (APACA) has been introduced. Finally, ...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملThe Pickup and Delivery Multi-depot Vehicle Routing Problem
We address in this paper the pickup and delivery multi-depot vehicle routing problem (PDMDVRP). In this problem, a single commodity type is collected from a set of pickup customers to be delivered to a set of delivery customers by vehicles dispatched from multiple depots. The proposed problem has many applications in practice such as distribution of money between the branches of a bank, and mov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S web of conferences
سال: 2023
ISSN: ['2555-0403', '2267-1242']
DOI: https://doi.org/10.1051/e3sconf/202338801026